Exploring Optimal Pump Scheduling in Water Distribution Networks with Branch and Bound Methods
نویسندگان
چکیده
منابع مشابه
Optimal Pump Scheduling For Water Distribution Systems
Three different mathematical formulations for the scheduling of pumps to minimize energy consumption while still satisfying operational constraints are presented. Each formulation requires the solution of a highly nonlinear optimization problem that requires the iterative solution of an external numerical model for evaluating and satisfying the operational constraints. Two different algorithms ...
متن کاملOptimal Scheduling Using Branch and Bound with SPIN 4.0
The use of model checkers to solve discrete optimisation problems is appealing. A model checker can first be used to verify that the model of the problem is correct. Subsequently, the same model can be used to find an optimal solution for the problem. This paper describes how to apply the new Promela primitives of Spin 4.0 to search effectively for the optimal solution. We show how Branch-and-B...
متن کاملA Branch-and-Bound Method for the Optimal Scheduling
This paper presents a new approach to the scheduling problem in high level synthesis. In this approach, iterative rescheduling processes are performed in a branch-andbound manner, starting with the as soon as possible scheduling result, so as to find the scheduling result of the lowest hardware cost under the given timing constraint. At each iteration step, only the candidate nodes are selected...
متن کاملParallel branch-and-bound methods for thejob-shop scheduling problem
Job-Shop Scheduling (JSS) problems are among the more difficult to solve in the class of N P -complete problems. The only successful approach has been Branch-and-Bound based algorithms, but such algorithms depend heavily on good bound functions. Much work has been done to identify such functions for the JSS problem, but with limited success. Even with recent methods, it is still not possible to...
متن کاملA Single Machine Sequencing Problem with Idle Insert: Simulated Annealing and Branch-and-Bound Methods
In this paper, a single machine sequencing problem is considered in order to find the sequence of jobs minimizing the sum of the maximum earliness and tardiness with idle times (n/1/I/ETmax). Due to the time complexity function, this sequencing problem belongs to a class of NP-hard ones. Thus, a special design of a simulated annealing (SA) method is applied to solve such a hard problem. To co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Water Resources Management
سال: 2016
ISSN: 0920-4741,1573-1650
DOI: 10.1007/s11269-016-1490-8